Hypergraph cuts above the average
نویسندگان
چکیده
منابع مشابه
Temporal processing ability in above average and average readers.
In the present study, we compared the rapid visual and auditory temporal processing ability of above average and average readers. One hundred five undergraduates participated in various visual and auditory temporal tasks. The above average readers exhibited lower auditory and visual temporal resolution thresholds than did the average readers, but only the differences in the auditory tasks were ...
متن کاملParameterized Complexity of MaxSat above Average
In MaxSat, we are given a CNF formula F with n variables and m clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let r1, . . . , rm be the number of literals in the clauses of F . Then asat(F ) = ∑m i=1(1 − 2 −ri) is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independ...
متن کاملSatisfiability of Ordering CSPs Above Average
We study the satisfiability of ordering constraint satisfaction problems (CSPs) above average. We show that for every k, the satisfiability above average of ordering CSPs of arity at most k is fixed-parameter tractable.
متن کاملDominance guarantees for above-average solutions
Gutin et al. [G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Discrete Applied Mathematics 119 (1–2) (2002) 107–116] proved that, in the ATSP problem, a tour of weight not exceeding the weight of an average tour is of dominance ratio at least 1/(n − 1) for all n 6= 6. (Tours with this property can be easily obtained.) In [N. Alon...
متن کاملNote on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to find an assignment of values to the variables which maximizes the total weight of satisfied equations. This problem generalizes Max Cut. The expected weight of satisfied equations is W/2, where W = w1 + · · ·+ wm; W/2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2019
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-019-1897-z